Concurrent Non-Malleable Commitments from One-way Functions
نویسندگان
چکیده
We show the existence of concurrent non-malleable commitments based on the existence one-way functions. Our proof of security only requires the use of black-box techniques, and additionally provides an arguably simplified proof of the existence of even stand-alone secure non-malleable commitments. Cornell University, E-Mail: [email protected] Cornell University, E-Mail: [email protected] Cornell University, E-Mail: [email protected]
منابع مشابه
Concurrent Non-malleable Commitments from Any One-Way Function
We show the existence of concurrent non-malleable commitments based on the existence of one-way functions. Our proof of security only requires the use of black-box techniques, and additionally provides an arguably simplified proof of the existence of even stand-alone secure non-malleable commitments.
متن کاملAn Efficient Adaptive-Deniable-Concurrent Non-malleable Commitment Scheme
It is known that composable secure commitments, that is, concurrent non-malleable commitments exist in the plain model, based only on standard assumptions such as the existence of claw-free permutations or even one-way functions. Since being based on the plain model, the deniability of them is trivially satisfied, and especially the latter scheme satisfies also adaptivity, hence it is adaptived...
متن کاملConcurrent Non-Malleable Commitments (and More) in 3 Rounds
The round complexity of commitment schemes secure against man-in-the-middle attacks has been the focus of extensive research for about 25 years. The recent breakthrough of Goyal, Pandey and Richelson [STOC 2016] showed that 3 rounds are sufficient for (one-left, one-right) non-malleable commitments. This result matches a lower bound of [Pas13]. The state of affairs leaves still open the intrigu...
متن کامل4-Round Concurrent Non-Malleable Commitments from One-Way Functions
How many rounds and which computational assumptions are needed for concurrent nonmalleable commitments? The above question has puzzled researchers for several years. Recently, Pass in [TCC 2013] proved a lower bound of 3 rounds when security is proven through black-box reductions to falsifiable assumptions. On the other side, positive results of Goyal [STOC 2011], Lin and Pass [STOC 2011] and G...
متن کاملFour-Round Concurrent Non-Malleable Commitments from One-Way Functions
How many rounds and which computational assumptions are needed for concurrent nonmalleable commitments? The above question has puzzled researchers for several years. Recently, Pass in [TCC 2013] proved a lower bound of 3 rounds when security is proven through black-box reductions to falsifiable assumptions. On the other side, positive results of Goyal [STOC 2011], Lin and Pass [STOC 2011] and G...
متن کامل